J ul 2 01 3 Is the five - flow conjecture almost false ?
نویسندگان
چکیده
The number of nowhere zero ZQ flows on a graph G can be shown to be a polynomial in Q, defining the flow polynomial ΦG(Q). According to Tutte’s five-flow conjecture, ΦG(5) > 0 for any bridgeless G. A conjecture by Welsh that ΦG(Q) has no real roots for Q ∈ (4,∞) was recently disproved by Haggard, Pearce and Royle. These authors conjectured the absence of roots for Q ∈ [5,∞). We study the real roots of ΦG(Q) for a family of non-planar cubic graphs known as generalised Petersen graphs G(m,k). We show that the modified conjecture on real flow roots is also false, by exhibiting infinitely many real flow roots Q > 5 within the class G(nk, k). In particular, we compute explicitly the flow polynomial of G(119, 7), showing that it has real roots at Q ≈ 5.0000197675 and Q ≈ 5.1653424423. We moreover prove that the graph families G(6n, 6) and G(7n, 7) possess real flow roots that accumulate at Q = 5 as n → ∞ (in the latter case from above and below); and that Qc(7) ≈ 5.2352605291 is an accumulation point of real zeros of the flow polynomials for G(7n, 7) as n → ∞.
منابع مشابه
ar X iv : 0 80 6 . 01 70 v 2 [ m at h . Q A ] 1 J ul 2 00 8 WEIGHT MULTIPLICITY POLYNOMIALS OF MULTI - VARIABLE WEYL MODULES
This paper is based on the observation that dimension of weight spaces of multi-variable Weyl modules depends polynomially on the highest weight (Conjecture 1). We support this conjecture by various explicit answers for up to three variable cases and discuss the underlying combinatorics.
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملWavelet Expansion and High-order Regularization for Multiscale Fluid-motion Estimation
We consider a novel optic flow estimation algorithm based on a wavelet expansion of the velocity field. In particular, we propose an efficient gradient-based estimation algorithm which naturally encompasses the estimation process into a multiresolution framework while avoiding most of the drawbacks common to this kind of hierarchical methods. We then emphasize that the proposed methodology is w...
متن کاملRestricted Frame Graphs and a Conjecture of Scott
Scott proved in 1997 that for any tree T , every graph with bounded clique number which does not contain any subdivision of T as an induced subgraph has bounded chromatic number. Scott also conjectured that the same should hold if T is replaced by any graph H. Pawlik et al. recently constructed a family of trianglefree intersection graphs of segments in the plane with unbounded chromatic number...
متن کاملOn Silverman's conjecture for a family of elliptic curves
Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013